Unconventional Algorithms: Complementarity of Axiomatics and Construction

نویسندگان

  • Gordana Dodig Crnkovic
  • Mark Burgin
چکیده

In this paper, we analyze axiomatic and constructive issues of unconventional computations from a methodological and philosophical point of view. We explain how the new models of algorithms and unconventional computations change the algorithmic universe, making it open and allowing increased flexibility and expressive power that augment creativity. At the same time, the greater power of new types of algorithms also results in the greater complexity of the algorithmic universe, transforming it into the algorithmic multiverse and demanding new tools for its study. That is why we analyze new powerful tools brought forth by local mathematics, local logics, logical varieties and the axiomatic theory of algorithms, automata and computation. We demonstrate how these new tools allow efficient navigation in the algorithmic multiverse. Further work includes study of natural computation by unconventional algorithms and constructive approaches.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Simulation of Pore Water Pressure in the Body of Earthen Dams during Construction Using Combining Meta-Heuristic Algorithms and ANFIS

Accurate prediction of pore water pressure in the body of earth dams during construction with accurate methods is one of the most important components in managing the stability of earth dams. The main objective of this research is to develop hybrid models based on fuzzy neural inference systems and meta-heuristic optimization algorithms. In this regard, the fuzzy neural inference system and opt...

متن کامل

Construction cost estimation of spherical storage tanks: artificial neural networks and hybrid regression—GA algorithms

One of the most important processes in the early stages of construction projects is to estimate the cost involved. This process involves a wide range of uncertainties, which make it a challenging task. Because of unknown issues, using the experience of the experts or looking for similar cases are the conventional methods to deal with cost estimation. The current study presents data-driven metho...

متن کامل

A full Nesterov-Todd step infeasible interior-point algorithm for symmetric cone linear complementarity problem

‎A full Nesterov-Todd (NT) step infeasible interior-point algorithm‎ ‎is proposed for solving monotone linear complementarity problems‎ ‎over symmetric cones by using Euclidean Jordan algebra‎. ‎Two types of‎ ‎full NT-steps are used‎, ‎feasibility steps and centering steps‎. ‎The‎ ‎algorithm starts from strictly feasible iterates of a perturbed‎ ‎problem‎, ‎and, using the central path and feasi...

متن کامل

Solving the Quadratic Eigenvalue Complementarity Problem by DC Programming

We present in this paper some results for solving the Quadratic Eigenvalue Complementarity Problem (QEiCP) by using DC(Difference of Convex functions) programming approaches. Two equivalent Nonconvex Polynomial Programming (NLP) formulations of QEiCP are introduced. We focus on the construction of the DC programming formulations of the QEiCP from these NLPs. The corresponding numerical solution...

متن کامل

Two randomized incramental algorithms for planar arrangements, with a twist

We present two results related to randomized incremental construction of planar arrangements: • An algorithm for computing the union of triangles in the plane in a quasi outputsensitive time. • A more efficient alternative to vertical decomposition of arrangements of lines in the plane, called polygonal decomposition. An efficient randomized incremental algorithm for its construction is present...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:
  • Entropy

دوره 14  شماره 

صفحات  -

تاریخ انتشار 2012